Formulas for Calculating Supremal Controllable and Normal Sublanguages
نویسندگان
چکیده
Supremal controllable and normal sublanguages have been shown to play an important role in supervisor synthesis. In this paper, we discuss the computation of supremal controllable and normal sublanguages. We derive formulas for both supremal controllable sublanguages and supremal normal sublanguages when the languages involved are closed. As a result, those languages can be computed without applying recursive algorithms. We also discuss the computational aspects of these formulas.
منابع مشابه
Supremal normal sublanguages in hierarchical supervisory control
In this paper, we study hierarchical supervisory control with partial observations. In particular, we are interested in preservation of supremal normal and supremal controllable and normal sublanguages from the abstracted system (high level) in the original (low level) system. Sufficient conditions are formulated under which the supremal normal or the supremal controllable and normal sublanguag...
متن کاملComputing Supremal Minimum-Weight Controllable and Normal Sublanguages
In practical applications we are frequently required to find a supervisor that can achieve certain optimal performance. Some performance such as maximum throughput or minimum execution time/cost can be specified in terms of weights. In this paper we first define a minimum-weight supervisory control problem on weighted discrete-event systems. Then we show that, the supremal minimum-weight contro...
متن کاملControl of Modular and Distributed Discrete-Event Systems
Control of modular and distributed discrete-event systems appears as an approach to handle computational complexity of synthesizing supervisory controllers for large scale systems. For both modular and distributed discrete-event systems sufficient and necessary conditions are derived for modular control synthesis to equal global control synthesis for the supremal controllable sublanguage, for t...
متن کاملOn nonconflicting languages that arise in supervisory control of discrete event systems *
We study four classes of nonconflicting sublanguages of a given language that arise in supervisory control of discrete event systems. We first present closed-form expressions for the supremal nonconflicting sublanguage and for the supremal closed nonconflicting sublanguage of a given language. The nonconflicting condition is with respect to a second given language. We then present algorithms to...
متن کاملOn-Line Control of Discrete Event Systems with a Maximally Controllable and Observable Sublanguage
Recently, many on-line control methods of partially observed discrete event systems(DES’s) have been proposed. This paper proposes an algorithm for on-line control based on a supervisor under complete observation. It is shown that DES’s controlled by the proposed on-line controller generate maximally controllable and observable sublanguages which include the supremal normal sublanguages. Moreov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990